Deduction theorems in significance logics.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Note on Deduction Theorems in Contraction-Free Logics

In this short paper we present a finer analysis of the variants of Local Deduction Theorem in contraction-free logics. We define some natural generalisations called Implicational Deduction Theorems and study their basic properties. The hierarchy of classes of logics defined by these theorems is presented.

متن کامل

Planning in Description Logics : Deduction versus

Description Logics (DLs) are formalisms for taxonomic reasoning about structured knowledge. Adding the transitive closure of roles to DLs also enables them to represent and reason about actions and plans. The present paper explores several essentially diierent encodings of planning in Description Logics. We argue that DLs represent an ideal framework for analysing and comparing these approaches...

متن کامل

Efficient Deduction in Many-Valued Logics

This paper tries to identify the basic problems e.countered in automated theorem proving in many-valued logics and demonstrates to which extent they call be currently solved. To this end a .umber of recently developed techniques are reviewed. We list. tile avenues of research in manyvalued theorem proving that are in our eyes the most promising.

متن کامل

Deduction-detachment theorem in hidden k-logics

Modern software systems usually deal with several sorts (types) of data elements simultaneously. Some of these sorts, like integers, booleans, and so on, can be seen as having an immediate, direct nature and therefore are called visible, and they are contrasted with the others, like types of objects (in OO sense), which are called hidden sorts. A language used to specify such software system ha...

متن کامل

Automated Deduction for Logics of Default Reasoning

We present a tableau calculus for the rational logic R of default reasoning, introduced by Kraus, Lehmann and Magidor. Our calculus is obtained by introducing suitable modalities to interpret conditional assertions, it makes use of labels to represent possible worlds, and it can be used to provide a decision procedure for R.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 1979

ISSN: 0029-4527

DOI: 10.1305/ndjfl/1093882680